Ela Maxima of the Q-index: Graphs without Long Paths
نویسندگان
چکیده
This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of graphs with no paths of given order. Thus, let Sn,k be the join of a complete graph of order k and an independent set of order n− k, and let S n,k be the graph obtained by adding an edge to Sn,k. The main result of the paper is the following theorem: Let k ≥ 1, n ≥ 7k, and let G be a graph of order n. (i) If q (G) ≥ q (
منابع مشابه
Maxima of the Q-index: graphs without long paths
This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of graphs with no paths of given order. Thus, let Sn,k be the join of a complete graph of order k and an independent set of order n− k, and let S n,k be the graph obtained by adding an edge to Sn,k. The main result of the paper is the following theorem: Let k ≥ 1, n ≥ 7k, and let G be a graph of order n...
متن کاملEla Maxima of the Q-index: Graphs with Bounded Clique Number∗
This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of given order and clique number. More precisely, let G be a graph of order n, let A be its adjacency matrix, and let D be the diagonal matrix of the row-sums of A. If G has clique number ω, then the largest eigenvalue q (G) of the matrix Q = A+D satisfies q (G) ≤ 2 (1− 1/ω)n. If G is a complete regu...
متن کاملEla Maxima of the Q-index: Degenerate Graphs
Abstract. Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the join of a complete graph of order k and an independent set of order n−k. In this note, it is shown that Sn,k is extremal for some spectral parameters of G as well. More precisely, letting μ (H) and q (H) denote the largest eigenvalues of the adjacency matrix and the signless Laplacian of...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملNew Bounds on Zagreb Indices
The Zagreb indices are among the oldest and the most famous topological molecular structure-descriptors. The first Zagreb index is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index is equal to the sum of the products of the degrees of pairs of adjacent vertices of the respective graph. In this paper, we characterize the extremal graphs with maximal, sec...
متن کامل